منابع مشابه
Latent class models for classification
An overview is provided of recent developments in the use of latent class (LC) and other types of %nite mixture models for classi%cation purposes. Several extensions of existing models are presented. Two basic types of LC models for classi%cation are de%ned: supervised and unsupervised structures. Their most important special cases are presented and illustrated with an empirical example. c © 20...
متن کاملSequential Dynamic Classification Using Latent Variable Models
Adaptive classification is an important online problem in data analysis. The nonlinear and nonstationary nature of much data makes standard static approaches unsuitable. In this paper, we propose a set of sequential dynamic classification algorithms based on extension of nonlinear variants of Bayesian Kalman processes and dynamic generalized linear models. The approaches are shown to work well ...
متن کاملLatent classification models for binary data
One of the simplest, and yet most consistently well-performing set of classifiers is the näıve Bayes models (a special class of Bayesian network models). However, these models rely on the (näıve) assumption that all the attributes used to describe an instance are conditionally independent given the class of that instance. To relax this independence assumption, we have in previous work proposed ...
متن کاملLatent variable discovery in classification models
The naive Bayes model makes the often unrealistic assumption that the feature variables are mutually independent given the class variable. We interpret a violation of this assumption as an indication of the presence of latent variables, and we show how latent variables can be detected. Latent variable discovery is interesting, especially for medical applications, because it can lead to a better...
متن کاملCombining Probabilistic Search, Latent Variable Analysis and Classification Models
The EM and1 K-Means algorithms are two popular search techniques that converge to a local minimum of their respective loss functions. The EM algorithm uses partial assignment of instances while the K-Means algorithm uses exclusive assignment. We show that an exclusive random assignment (ERA) algorithm that performs exclusive assignment based on a random experiment can outperform both EM and K-M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2005
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-005-0472-5